Distributed pursuit-evasion without mapping or global localization via local frontiers
نویسندگان
چکیده
This paper addresses a visibility-based pursuit-evasion problem in which a team of mobile robots with limited sensing and communication capabilities must coordinate to detect any evaders in an unknown, multiply-connected planar environment. Our distributed algorithm to guarantee evader detection is built around maintaining complete coverage of the frontier between cleared and contaminated regions while expanding the cleared region. We detail a novel distributed method for storing and updating this frontier without building a map of the environment or requiring global localization. We demonstrate the functionality of the algorithm through simulations in realistic environments and through hardware experiments. We also compare Monte Carlo results for our algorithm to the theoretical optimum area cleared as a function of the number of robots available.
منابع مشابه
Distributed Pursuit-Evasion without Global Localization via Local Frontiers
This paper addresses a visibility-based pursuit-evasion problem in which a team of mobile robots with limited sensing and communication capabilities must coordinate to detect any evaders in an unknown, multiply-connected planar environment. Our distributed algorithm can guarantee evader detection and is built around maintaining complete coverage of the frontier between cleared and contaminated ...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملGap Navigation Trees: Minimal Representation for Visibility-based Tasks
In this paper we present our advances in a data structure, the Gap Navigation Tree (GNT), useful for solving different visibility-based robotic tasks in unknown planar environments. We present its use for optimal robot navigation in simply-connected environments, locally optimal navigation in multiply-connected environments, pursuit-evasion, and robot localization. The guiding philosophy of thi...
متن کاملRobotics: Science and Systems IV
held at the Swiss Federal Institute of Technology (ETH) in Zurich Switzerland, from June 25 to June 28, 2008. Robotics: Science and Systems is a single-track conference that aims to showcase the best research and the most exciting systems from all areas of robotics at a single conference to a broad audience. Special provisions are made to enable students to participate in this conference. This ...
متن کاملProbabilistic pursuit-evasion games: theory, implementation, and experimental evaluation
We consider the problem of having a team of Unmanned Aerial Vehicles (UAV) and Unmanned Ground Vehicles (UGV) pursue a second team of evaders while concurrently building a map in an unknown environment. We cast the problem in a probabilistic game theoretic framework and consider two computationally feasible greedy pursuit policies: local-max and global-max. To implement this scenario on real UA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Auton. Robots
دوره 32 شماره
صفحات -
تاریخ انتشار 2012